An Efficient Computational Approach for Inverse Kinematics Analysis of the UR10 Robot with SQP and BP-SQP Algorithms
نویسندگان
چکیده
Two algorithms that are distinct from the closed algorithm proposed to create inverse kinematics model of UR10 robot: Sequential Quadratic Programming (SQP) and Back Propagation-Sequential (BP-SQP) algorithm. The SQP is an iterative in which fundamental tenet joint’s total rotation radian should be at a minimum when industrial robot reaches target attitude. With this tenet, establishes robot. Since overly reliant on initial values, deviations occur easily solution speed, accuracy undermined. To assuage disadvantage algorithm, BP-SQP incorporating neural network introduced optimize values. results show relies excessively values has narrow range applications. eliminates limitations time complexity greatly reduced. Subsequently, effectiveness verified. can significantly reduce operation compared with faster but requires certain number samples as prerequisite.
منابع مشابه
Analysis of Inexact Trust-Region SQP Algorithms
In this paper we study the global convergence behavior of a class of composite–step trust–region SQP methods that allow inexact problem information. The inexact problem information can result from iterative linear systems solves within the trust–region SQP method or from approximations of first–order derivatives. Accuracy requirements in our trust– region SQP methods are adjusted based on feasi...
متن کاملnano-rods zno as an efficient catalyst for the synthesis of chromene phosphonates, direct amidation and formylation of amines
چکیده ندارد.
An inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کاملAnalysis of Inexact Trust-Region Interior-Point SQP Algorithms
In this paper we analyze inexact trust–region interior–point (TRIP) sequential quadra– tic programming (SQP) algorithms for the solution of optimization problems with nonlinear equality constraints and simple bound constraints on some of the variables. Such problems arise in many engineering applications, in particular in optimal control problems with bounds on the control. The nonlinear constr...
متن کاملAn NE / SQP Method for the Bounded
NE/SQP is a recent algorithm that has proven quite eeective for solving the pure and mixed forms of the nonlinear complementarity problem (NCP). NE/SQP is robust in the sense that its direction-nding subproblems are always solvable; in addition, the convergence rate of this method is Q-quadratic. In this paper we consider a generalized version of NE/SQP proposed by Pang and Qi, that is suitable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2023
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app13053009